On Decomposition for Incomplete Data

نویسنده

  • Rafal Latkowski
چکیده

In this paper we present a method of data decomposition to avoid the necessity of reasoning on data with missing attribute values. The original incomplete data is decomposed into data subsets without missing values. Next, methods for classifier induction are applied to such sets. Finally, a conflict resolving method is used to combine partial answers from classifiers to obtain final classification. We provide an empirical evaluation of the decomposition method accuracy and model size with use of various decomposition criteria.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Incomplete Data Decomposition for Classification

In this paper we present a method of data decomposition to avoid the necessity of reasoning on data with missing attribute values. The original incomplete data is decomposed into data subsets without missing values. Next, methods for classifier induction are applied to such sets. Finally, a conflict resolving method is used to combine partial answers from classifiers to obtain final classificat...

متن کامل

Parallel Incomplete Cholesky Preconditioners Based on the Non-Overlapping Data Distribution

The paper analyses various parallel incomplete factorizations based on the non-overlapping domain decomposition. The general framework is applied to the investigation of the preconditioning step in cg-like methods. Under certain conditions imposed on the nite element mesh, all matrix and vector types given by the special data distribution can be used in the matrix-by-vector multiplications. Not...

متن کامل

A Fuzzy C-means Algorithm for Clustering Fuzzy Data and Its Application in Clustering Incomplete Data

The fuzzy c-means clustering algorithm is a useful tool for clustering; but it is convenient only for crisp complete data. In this article, an enhancement of the algorithm is proposed which is suitable for clustering trapezoidal fuzzy data. A linear ranking function is used to define a distance for trapezoidal fuzzy data. Then, as an application, a method based on the proposed algorithm is pres...

متن کامل

Damage detection of skeletal structures using particle swarm optimizer with passive congregation (PSOPC) algorithm via incomplete modal data

This paper uses a PSOPC model based non-destructive damage identification procedure using frequency and modal data. The objective function formulation for the minimization problem is based on the frequency changes. The method is demonstrated by using a cantilever beam, four-bay plane truss and two-bay two-story plane frame with different scenarios. In this study, the modal data are provided nume...

متن کامل

Fast algorithms for Higher-order Singular Value Decomposition from incomplete data

Higher-order singular value decomposition (HOSVD) is an efficient way for data reduction and also eliciting intrinsic structure of multi-dimensional array data. It has been used in many applications, and some of them involve incomplete data. To obtain HOSVD of the data with missing values, one can first impute the missing entries through a certain tensor completion method and then perform HOSVD...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Fundam. Inform.

دوره 54  شماره 

صفحات  -

تاریخ انتشار 2003